Resolving of Intersection Types in Java

In the past we analyzed typeless Java programs. One of our results was, that there may be different correct typings for one method. This means that the principal types of such methods are intersection types. We presented a type-inference algorithm. For typeless Java methods the algorithm infers its principal intersection type. Unfortunately, like Java byte-code, Java does not allow intersection types. In this paper we present an algorithm, which resolves intersection types of Java methods, such that Java programs with standard typings are generated. Additionally, we will refine the definition of Java method principal types.